Dynamic Admission Control for Loss Systems with Batch Arrivals
نویسنده
چکیده
We consider the problem of dynamic admission control in a Markovian loss system with two classes. Jobs arrive at the system in batches, where each admitted job requires different service rates and brings different revenues depending on its class. We introduce the definition of “preferred class” for systems receiving mixed and one-class batches separately, and derive sufficient conditions for each system to have a preferred class. We also establish a monotonicity property of the optimal value functions, which reduces the number of possibly optimal actions.
منابع مشابه
Admission control with batch arrivals
We consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate μ, and brings a reward ri. We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملA discrete - time Geo [ X ] / G / 1 retrial queue with control of admission
This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which individual arriving customers have a control of admission. We study the underlying Markov chain at the epochs immediately after the slot boundaries making emphasis on the computation of its steady-state distribution. To this end we employ numerical inversion and maximum entropy techniques. We also establish a...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملAnalysis of the Dynamics of CDMA Reverse Link Power Control
In this paper we develop an analytical expression for the mobile station transmit power based on a discrete time and state space. In our model we focus on the timevarying distortions found in a CDMA reverse link channel, network delays, and the fluctuations in multi-access interference. Based on this description we are able to characterize the dynamic behavior of the power control loop and its ...
متن کامل